Breaking the dimensionality curse in multi-server queues
نویسندگان
چکیده
منابع مشابه
Breaking the curse of dimensionality in regression
Models with many signals, high-dimensional models, often impose structures on the signal strengths. The common assumption is that only a few signals are strong and most of the signals are zero or close (collectively) to zero. However, such a requirement might not be valid in many real-life applications. In this article, we are interested in conducting large-scale inference in models that might ...
متن کاملBreaking the Curse of Dimensionality with Convex Neural Networks
We consider neural networks with a single hidden layer and non-decreasing positively homogeneous activation functions like the rectified linear units. By letting the number of hidden units grow unbounded and using classical non-Euclidean regularization tools on the output weights, they lead to a convex optimization problem and we provide a detailed theoretical analysis of their generalization p...
متن کاملTowards Breaking the Curse of Dimensionality for High-Dimensional Privacy
The curse of dimensionality has remained a challenge for a wide variety of algorithms in data mining, clustering, classification and privacy. Recently, it was shown that an increasing dimensionality makes the data resistant to effective privacy. The theoretical results seem to suggest that the dimensionality curse is a fundamental barrier to privacy preservation. However, in practice, we show t...
متن کاملMulti-Server Queues Subject to Server Interruptions
This paper concerns discrete-time queueing systems operating under a first-come-first-served queueing discipline, with deterministic service times of one slot and subject to independent server interruptions. We derive a relationship between the probability generating functions of the system contents during an arbitrary slot and of the system delay of an arbitrary customer. This relationship is ...
متن کاملThe curse of dimensionality
In this text, some question related to higher dimensional geometrical spaces will be discussed. The goal is to give the reader a feeling for geometric distortions related to the use of such spaces (e.g. as search spaces).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2016
ISSN: 0305-0548
DOI: 10.1016/j.cor.2016.04.011